On Essentially 4-Edge-Connected Cubic Bricks
نویسندگان
چکیده
منابع مشابه
Spanning trails in essentially 4-edge-connected graphs
A connected graphG is essentially 4-edge-connected if for any edge cut X ofGwith |X | < 4, either G − X is connected or at most one component of G − X has edges. In this paper, we introduce a reductionmethod and investigate the existence of spanning trails in essentially 4-edge-connected graphs. As an application, we prove that if G is 4-edge-connected, then for any edge subset X0 ⊆ E(G) with |...
متن کاملOn Longest Cycles in Essentially 4-connected Planar Graphs
A planar 3-connected graph G is essentially 4-connected if for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex. B. Jackson and N.C. Wormald proved that an essentially 4-connected planar graph on n vertices contains a cycle C such that |V (C)| ≥ 2n+4 5 . For a cubic essentially 4-connected planar graph G, B. Grünbaum, J. Malkevitch , and C.-Q. ...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملA Note on Arboricity of 2-edge-connected Cubic Graphs
The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned so that each subset induces a forest. It is well known that a(G) ≤ 3 for any planar graph G, and that a(G) ≤ 2 for any planar graph G of diameter at most 2. The conjecture that every planar graph G without 3-cycles has a vertex partition (V1, V2) such that V1 is an ind...
متن کاملA 4/3-approximation for TSP on cubic 3-edge-connected graphs
We consider the travelling salesman problem on metrics which can be viewed as the shortest path metric of an undirected graph with unit edge-lengths. Finding a TSP tour in such a metric is then equivalent to finding a connected Eulerian subgraph in the underlying graph. Since the length of the tour is the number of edges in this Eulerian subgraph our problem can equivalently be stated as follow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/8594